Unbounded System Verification using Decision Procedure and Predicate Abstraction
نویسنده
چکیده
Designs of hardware and software systems have grown in complexity to meet the demand for improved performance. The complexity of the design often manifests itself in the form of subtle and intricate design flaws and bugs. The cost of these errors can be prohibitive and often dictates the lifetime of a product. Most design teams allocate a substantial amount of their resources in testing and verifying a product.
منابع مشابه
Carnegie Mellon University Unbounded System Verification Using Decision Procedure and Predicate Abstraction
Modeling and analysis of systems with large, infinite or parameterized state spaces has received much attention in the last decade. These systems include microprocessors with unbounded buffers and memories; parameterized cache-coherence and communication protocols with unbounded channels; and distributed algorithms for mutual exclusion. Most previous works have either used general purpose theor...
متن کاملPredicate Abstraction based Verification Framework: First results
The Analysis of software artifacts is steadily advancing due to the increase in computational power and new verification methodologies. As a result there is a trend to approach the verification of the implementation level code and systems with unbounded state space rather than verification of abstract hand-built models of code. We consider a methodology which enables the verification of systems...
متن کاملIndexed Predicate Discovery for Unbounded System Verification
Predicate abstraction has been proved effective for verifying several infinite-state systems. In predicate abstraction, an abstract system is automatically constructed given a set of predicates. Predicate abstraction coupled with automatic predicate discovery provides for a completely automatic verification scheme. For systems with unbounded integer state variables (e.g. software), counterexamp...
متن کاملA Better Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs
Heap-manipulating programs (HMP), which manipulate unbounded linked data structures via pointers, are a major frontier for software model checking. In recent work, we proposed a small logic and inference-rule-based decision procedure and demonstrated their potential by verifying, via predicate abstraction, some simple HMPs. In this work, we generalize and improve our previous results to be prac...
متن کاملA Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs
An important and ubiquitous class of programs are heap-manipulating programs (HMP), which manipulate unbounded linked data structures by following pointers and updating links. Predicate abstraction has proved to be an invaluable technique in the field of software model checking; this technique relies on an efficient decision procedure for the underlying logic. The expression and proof of many i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004